Galois LCD codes over finite fields
نویسندگان
چکیده
منابع مشابه
Galois LCD codes over finite fields
In this paper, we study the complementary dual codes in more general setting (which are called Galois LCD codes) by a uniform method. A necessary and sufficient condition for linear codes to be Galois LCD codes is determined, and constacyclic codes to be Galois LCD codes are characterized. Some illustrative examples which constacyclic codes are Galois LCD MDS codes are provided as well. In part...
متن کاملConstructions of optimal LCD codes over large finite fields
In this paper, we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes. Construction methods include random sampling in the orthogonal group, code extension, matrix product codes and projection over a self-dual basis.
متن کاملSome new bounds on LCD codes over finite fields
In this paper, we show that LCD codes are not equivalent to linear codes over small finite fields. The enumeration of binary optimal LCD codes is obtained. We also get the exact value of LD(n, 2) over F3 and F4. We study the bound of LCD codes over Fq.
متن کاملDouble circulant self-dual and LCD codes over Galois rings
This paper investigates the existence, enumeration and asymptotic performance of self-dual and LCD double circulant codes over Galois rings of characteristic p and order p with p and odd prime. When p ≡ 3 (mod 4), we give an algorithm to construct a duality preserving bijective Gray map from such a Galois ring to Z p2 . Using random coding, we obtain families of asymptotically good self-dual an...
متن کاملThe equivalence of space-time codes and codes defined over finite fields and Galois rings
Space-time codes for a wide variety of channels have the property that the diversity of a pair of codeword matrices is measured by the vanishing or non-vanishing of polynomials in the entries of the matrices. We show that for every such channel: I) There is an appropriately-defined notion of approximation of space-time codes such that each code is arbitrarily well approximated by one whose alph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2018
ISSN: 1071-5797
DOI: 10.1016/j.ffa.2017.10.001